Complexity function - PDFSEARCH.IO - Document Search Engine

Complexity function
Results: 282

#	Item
231	Applied Mathematics and Computation xxx[removed]xxx–xxx Contents lists available at ScienceDirect Applied Mathematics and Computation journal homepage: www.elsevier.com/locate/amc Add to Reading List Source URL: scribblethink.org Language: English - Date: 2012-11-02 20:38:30 Applied mathematics Theory of computation Randomness Algorithmic information theory Information theory Kolmogorov complexity Algorithmically random sequence Complexity Computable function Theoretical computer science Mathematics Computability theory
232	CHAINS AND ANTICHAINS IN PARTIAL ORDERINGS VALENTINA S. HARIZANOV, CARL G. JOCKUSCH, JR., AND JULIA F. KNIGHT Abstract. We study the complexity of infinite chains and antichains in computable partial orderings. We show t Add to Reading List Source URL: www.math.uiuc.edu Language: English - Date: 2009-07-29 17:58:40 Order theory Computability theory Integer sequences Antichain Functions and mappings Computable function Tree Function Model theory Mathematics Mathematical logic Theory of computation
233	Restricted Boltzmann Machines are Hard to Approximately Evaluate or Simulate Philip M. Long Google Add to Reading List Source URL: www.phillong.info Language: English - Date: 2013-08-07 12:09:14 XTR Maximum likelihood Time complexity Spectral theory of ordinary differential equations Non-analytic smooth function Theoretical computer science Mathematics Applied mathematics
234	A COMPLEXITY THEORY OF CONSTRUCTIBLE FUNCTIONS AND SHEAVES SAUGATA BASU Abstract. In this paper we introduce analogues of the discrete complexity classes VP and VNP of sequences of functions in the Blum-Shub-Smale model. Add to Reading List Source URL: www.math.purdue.edu Language: English - Date: 2013-10-06 09:48:25 Algebraic topology Structural complexity theory Field theory Time hierarchy theorem Constructible sheaf Algebraic geometry Sheaf Constructible function Constructible universe Abstract algebra Mathematics Algebra
235	Permuted Function Matching Rapha¨el Clifforda , Benjamin Sach∗,a a Department of Computer Science, University of Bristol,UK Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-03-11 07:07:18 Combinatorial optimization Dynamic programming Combinatorics Operations research Knapsack problem Matching Permutation Pattern matching Time complexity Theoretical computer science Computational complexity theory Applied mathematics
236	SIPping from the firehose: Streaming Interactive Proofs for verifying computations Graham Cormode [removed] Amit Chakrabarti (Dartmouth) Add to Reading List Source URL: www.cs.bris.ac.uk Language: English - Date: 2014-03-11 07:07:14 Complexity classes Search algorithms NP Hash function IP Arthur–Merlin protocol Database Interactive proof system Theoretical computer science Applied mathematics Probabilistic complexity theory
237	Distributed Computation of the Mode Fabian Kuhn Institute of Theoretical Computer Science ETH Zurich Add to Reading List Source URL: distcomp.ethz.ch Language: English - Date: 2008-06-11 09:51:04 Mathematics Selection algorithm Randomized algorithm Normal distribution Time complexity Big O notation Hash function Theoretical computer science Analysis of algorithms Applied mathematics
238	Pinpointing in the Description Logic EL Franz Baader1, Rafael Pe˜ naloza2⋆ , and Boontawee Suntisrivaraporn1 1 Theoretical Computer Science, TU Dresden, Germany Add to Reading List Source URL: www.ceur-ws.org Language: English - Date: 2007-05-22 01:39:22 Ontology Mathematical logic Abox Function Tbox Algorithm Axiom Boolean satisfiability problem Time complexity Mathematics Theoretical computer science Applied mathematics
239	A Scalable and Nearly Uniform Generator of SAT Witnesses? Supratik Chakraborty1 , Kuldeep S. Meel2 , and Moshe Y. Vardi2 1 arXiv:1304.1584v1 [cs.LO] 4 Apr 2013 Add to Reading List Source URL: arxiv.org Language: English - Date: 2013-04-07 20:21:28 Search algorithms Cryptographic hash functions Analysis of algorithms Probabilistic complexity theory Randomized algorithm Algorithm PP Hash function Universal hashing Theoretical computer science Applied mathematics Computational complexity theory
240	A fast algorithm for learning large scale preference relations Vikas C. Raykar, Ramani Duraiswami Add to Reading List Source URL: www.umiacs.umd.edu Language: English - Date: 2007-02-01 22:57:02 Error function Gaussian function Operations research Normal distribution Conjugate gradient method Mathematical optimization Time complexity Mathematical analysis Theoretical computer science Mathematics

UPDATE